Data-driven Harris Hawks constrained optimization for computationally expensive constrained problems

نویسندگان

چکیده

Abstract Aiming at the constrained optimization problem where function evaluation is time-consuming, this paper proposed a novel algorithm called data-driven Harris Hawks (DHHCO). In DHHCO, Kriging models are utilized to prospect potentially optimal areas by leveraging computationally expensive historical data during optimization. Three powerful strategies are, respectively, embedded into different phases of conventional (HHO) generate diverse candidate sample for exploiting around existing and exploring uncharted region. Moreover, Kriging-based strategy composed population construction individual selection presented, which fully mines utilizes potential available information in data. DHHCO inherits develops HHO's offspring updating mechanism, meanwhile exerts prediction ability Kriging, reduces number evaluations, provides new ideas constraint Comprehensive experiments have been conducted on 13 benchmark functions real-world problem. The experimental results suggest that can achieve quite competitive performance compared with six representative algorithms find near global optimum 200 evaluations most examples. applied structural internal components real underwater vehicle, final satisfactory weight reduction effect more than 18%.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Memetic algorithm using multi-surrogates for computationally expensive optimization problems

In this paper, we present a Multi-Surrogates Assisted Memetic Algorithm (MSAMA) for solving optimization problems with computationally expensive fitness functions. The essential backbone of our framework is an evolutionary algorithm coupled with a local search solver that employs multi-surrogates in the spirit of Lamarckian learning. Inspired by the notion of 'blessing and curse of uncertainty'...

متن کامل

Evolutionary Optimization for Computationally expensive problems using Gaussian Processes

The use of statistical models to approximate detailed analysis codes for evolutionary optimization has attracted some attention [1-3]. However, those early methodologies do suffer from some limitations, the most serious of which being the extra tuning parameter introduceds. Also the question of when to include more data points to the approximation model during the search remains unresolved. Tho...

متن کامل

Equilibrium constrained optimization problems

We consider equilibrium constrained optimization problems, which have a general formulation that encompasses well-known models such as mathematical programs with equilibrium constraints, bilevel programs, and generalized semi-infinite programming problems. Based on the celebrated KKM lemma, we prove the existence of feasible points for the equilibrium constraints. Moreover, we analyze the topol...

متن کامل

Phi-Divergence Constrained Ambiguous Stochastic Programs for Data-Driven Optimization

This paper investigates the use of φ-divergences in ambiguous (or distributionally robust) two-stage stochastic programs. Classical stochastic programming assumes the distribution of uncertain parameters are known. However, the true distribution is unknown in many applications. Especially in cases where there is little data or not much trust in the data, an ambiguity set of distributions can be...

متن کامل

Evolutionary Optimization of Computationally Expensive Problems via Surrogate Modeling

We present a parallel evolutionary optimization algorithm that leverages surrogate models for solving computationally expensive design problems with general constraints, on a limited computational budget. The essential backbone of our framework is an evolutionary algorithm coupled with a feasible sequential quadratic programming solver in the spirit of Lamarckian learning.We employ a trust-regi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Complex & Intelligent Systems

سال: 2022

ISSN: ['2198-6053', '2199-4536']

DOI: https://doi.org/10.1007/s40747-022-00923-2